Hamiltonian Path based Shadow Removal

نویسندگان

  • Clément Fredembach
  • Graham D. Finlayson
چکیده

For some computer vision tasks, the presence of shadows in images can cause problems. For example, object tracks can be lost as an object crosses over a shadow boundary. Recently, it has been shown that it is possible to remove shadows from images. Assuming that the location of the shadows are known, shadow-free images are obtained in three steps. First, the image is differentiated. Second, the derivatives at the shadow edge are set to zero. Third, reintegration delivers an image without shadows. While this process can work well, the resultant shadow free image often has artifacts and, moreover, the reintegration is an expensive computational procedure. In this paper we propose a method which can produce shadow free images quickly and without artifacts. Our algorithm is based on two observations. First, that shadows in images are closed regions and if they are not closed artifacts can result during reintegration. Thus we propose to extend the existing methods and enforce the constraint that shadow boundaries must be closed prior to reintegration. Second, that the standard reintegration method used (solving a 2D Poisson equation) also, necessarily, introduces artifacts. The solution here is to reintegrate shadow and non shadow regions almost separately. Specifically, we reintegrate the image along a Hamiltonian path that enters and exits the shadow regions once. Detail that was masked out at the shadow boundary is then infilled in a second step. The resulting reintegrated image has much fewer artifacts. Moreover, since the reintegration method is path based it is both simple and fast. Experiments validate our approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hamiltionian path based shadow removal

For some computer vision tasks, the presence of shadows in images can cause problems. For example, object tracks can be lost as an object crosses over a shadow boundary. Recently, it has been shown that it is possible to remove shadows from images. Assuming that the location of the shadows are known, shadow-free images are obtained in three steps. First, the image is differentiated. Second, the...

متن کامل

Path-Based Shadow Removal

In the path based method, an error made at a time t1 is propagated throughout all t ≥ t1. We make the framework robust by addressing causes for errors and artifacts. • “Open” Shadow Masks: Wrong information propagated •Too many crossings of the shadow edge: sensitive to noise and material changes •Too regular paths: Easily visible artifacts •Sensitive information “under” shadow edges: reintegra...

متن کامل

Shadow Detection and its Removal in Images: A Review

Detecting objects under the influence of shadows is a difficult in computer vision. Shadows acts as barrier in correcting feature extraction of image features like buildings, towers etc. In urban regions, shadows cause artificial color nature and shape deformation of objects, which degrades the quality of images. In apparent path detection application, strong shadows on the road troubles the de...

متن کامل

Object Oriented Shadow Detection and Removal in Image Having Cast Shadows

A shadow is created when an object lies in the path of a light source. Shadows are cast by the occluding object, or the object itself can be shaded; a phenomenon known as “self-shading”. Due to the difference between the light intensity reaching a shaded region and a directly lit region, shadows are often characterized by strong brightness gradients. While non-shadow regions are illuminated by ...

متن کامل

Finding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms

  The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005